This paper deals with the dynamic routing problem in ATM cell-switching networks. We present amathematical programming model based on cell loss and a Tabu Search algorithm with short-termmemory that is reinforced with a long-term memory procedure. The estimation of the quality of thesolutions is fast, due to the specific encoding of the feasible solutions. The Tabu Search algorithm reachesgood quality solutions, outperforming other approaches such as Genetic Algorithms and the MinimumSwitching Path heuristic, regarding both cell loss and the CPU time consumption. The best results werefound for the more complex networks with a high number of switches and links.
展开▼
